Opposition-based learning multi-verse optimizer with disruption operator for optimization problems

نویسندگان

چکیده

Multi-verse optimizer (MVO) algorithm is one of the recent metaheuristic algorithms used to solve various problems in different fields. However, MVO suffers from a lack diversity which may trapping local minima, and premature convergence. This paper introduces two steps improving basic algorithm. The first step using opposition-based learning (OBL) MVO, called OMVO. OBL aids speed up searching technique for selecting better generation candidate solutions MVO. second stage, OMVOD, combines disturbance operator (DO) OMVO improve consistency chosen solution by providing chance given problem with high fitness value increase diversity. To test performance proposed models, fifteen CEC 2015 benchmark functions problems, thirty 2017 seven 2011 real-world were both phases enhancement. step, known as incorporates disruption accuracy giving while also increasing variety. Fifteen upgrade assess models.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STATIC AND DYNAMIC OPPOSITION-BASED LEARNING FOR COLLIDING BODIES OPTIMIZATION

Opposition-based learning was first introduced as a solution for machine learning; however, it is being extended to other artificial intelligence and soft computing fields including meta-heuristic optimization. It not only utilizes an estimate of a solution but also enters its counter-part information into the search process. The present work applies such an approach to Colliding Bodies Optimiz...

متن کامل

An Improved Cat Swarm Optimization Algorithm Based on Opposition-Based Learning and Cauchy Operator for Clustering

Clustering is a NP-hard problem that is used to find the relationship between patterns in a given set of patterns. It is an unsupervised technique that is applied to obtain the optimal cluster centers, especially in partitioned based clustering algorithms. On the other hand, cat swarm optimization (CSO) is a new metaheuristic algorithm that has been applied to solve various optimization problem...

متن کامل

An Adaptive Multi-Swarm Optimizer for Dynamic Optimization Problems

The multipopulation method has been widely used to solve dynamic optimization problems (DOPs) with the aim of maintaining multiple populations on different peaks to locate and track multiple changing optima simultaneously. However, to make this approach effective for solving DOPs, two challenging issues need to be addressed. They are how to adapt the number of populations to changes and how to ...

متن کامل

A Multi-Verse Optimizer with Levy Flights for Numerical Optimization and Its Application in Test Scheduling for Network-on-Chip

We propose a new meta-heuristic algorithm named Levy flights multi-verse optimizer (LFMVO), which incorporates Levy flights into multi-verse optimizer (MVO) algorithm to solve numerical and engineering optimization problems. The Original MVO easily falls into stagnation when wormholes stochastically re-span a number of universes (solutions) around the best universe achieved over the course of i...

متن کامل

Opposition-Based Barebones Particle Swarm for Constrained Nonlinear Optimization Problems

This paper presents a modified barebones particle swarm optimization OBPSO to solve constrained nonlinear optimization problems. The proposed approach OBPSO combines barebones particle swarm optimization BPSO and opposition-based learning OBL to improve the quality of solutions. A novel boundary search strategy is used to approach the boundary between the feasible and infeasible search region. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2022

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-022-07470-5